A set theoretic approach to broadcast encryption
نویسنده
چکیده
Broadcast Encryption allows a centre to send information over a broadcast channel to a dynamically changing group of users. The performance is rated by the bandwidth required for the broadcast and the amount of secret information needed to be stored at the user end. It can also be rated by the computational overhead. In the “Stateless Receiver” model, receivers are incapable of storing any new information, or updating themselves, between broadcasts. We look at two Stateless Receiver schemes by Naor et al., the Complete Subtree Revocation Scheme and the Subset Difference Revocation Scheme. We improve the bound on the bandwidth for the Complete Subtree Revocation Scheme given by Naor from tmax(n, r) ≤ r(k − log2(r)) to tmax(n, r) = r(k − j)− 2(r − 2), where j = blog2(r)c. We prove a similar bound on the maximum bandwidth for the Subset Difference Revocation Scheme. We also derive formula for the average bandwidth for both schemes. The schemes of Naor et al. are each based on a single binary tree. We construct some variations of the Complete Subtree Revocation Scheme, the first has more than one tree, the other is based on an a-ary tree. We calculate the improved performance in bandwidth (traded off against an increase in storage). We make meaningful comparisons between these schemes and existing ones. Finally, we show how to reduce the storage requirement of the Complete Subtree Revocation Scheme from O(log2(n)) to a constant term.
منابع مشابه
Design and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملBroadcast Encryption
Our system consists of a center and a set, U of n users. The center provides keys to the users when they join the system. Later on, the center wants to broadcast an encrypted message (such as the password to view “Matrix”) which can be deciphered only by a dynamically changing privileged subset of users, T , i.e., the non-privileged users should not be able to learn the message. To achieve this...
متن کاملKey Generation of Attribute Based Broadcast Encryption
Broadcast Encryption (BE) scheme is allows the sender to securely distribute a data to a dynamically changing set of users over a unsecure channel. Attribute based Broadcast Encryption (ABBE) is a excellent approach for broadcasting. Existing BE classical BE approach required an explicitly specified decrypter list. In ABBE differentiate groups of users by their attribute. In ABBE encrypter enfo...
متن کاملBroadcast Encryption for Differently Privileged
Broadcast encryption is a primary technology that has been used for content protection. It enables a broadcaster to distribute content to a set of users so that only a privileged subset of users can access the content and another subset of revoked users cannot access the content. The main enabling block in a broadcast encryption scheme is the session key block, which each authorized user proces...
متن کاملTowards Making Broadcast Encryption Practical
The problem we address is how to communicate securely with a set of users (the target set) over an insecure broadcast channel. In order to solve this problem, several broadcast encryption schemes have been proposed. In these systems, the parameters of major concern are the length of transmission and number of keys held by each user's set top terminal (STT). Due to the need to withstand hardware...
متن کامل